Concurrent Constraint Programming: Calculi, Languages and Emerging Applications
نویسندگان
چکیده
Process calculi treat concurrent processes much like the λ-calculus treat computable functions. They provide a language in which the structure of terms represents the structure of processes together with an operational semantics to represent computational steps. Concurrent Constraint Programming (CCP) is a process calculus which combines the traditional operational view of process calculi with a declarative one based upon logic. This combination allows CCP to benefit from the large body of techniques of both process calculi and logic. This paper presents a (non-complete) survey of CCP based process calculi. We also show the applicability of the CCP model summarizing the main application of these calculi in different scenarios: timed and reactive systems, biological systems, music interaction and analysis of security protocols
منابع مشابه
Concurrent Constraints in the Fusion Calculus ( extended
We use the fusion calculus, a generalization and simpliication of the-calculus, to model concurrent constraint programming. In particular we encode three basic variants of the-calculus, which is a foundational calculus for the concurrent constraint programming language Oz. Using a new reduction-based semantics and weak barbed congruences for the fusion calculus we formally establish an operatio...
متن کاملA universal interpreter for nondeterministic concurrentprogramming languages
Nondeterministic concurrent programming languages (ncpl) are languages which contain as primitive constructs nondeterministic choice and concurrent composition (inter-leaving). The best known are the languages based on CCS of Milner which are used as mathematical model of communication of concurrent processes. Concurrent constraint programming languages have been intensively studied during the ...
متن کاملProcess Calculi to Analyze Emerging Applications in Concurrency 1
The notion of computation has significantly evolved in the last ten years or so. Modern computing systems (e.g., Internet) now exhibit infinite behavior, usually in the context of decentralized networks where interactions are inherently concurrent. This new kind of systems is ubiquitous nowadays, so techniques for designing them in a reliable way are fundamental. Process calculi are formal spec...
متن کاملFlacos'08 Workshop Proceedings Flacos'08 Second Workshop on Formal Languages and Analysis of Contract-oriented Software Acknowledgments a Framework for Contract-based Reasoning: Motivation and Application 77 Cc-pi: a Constraint-based Language for Contracts with Service Level Agreements
Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). We overview a simple model of contracts for QoS and SLAs that combines two basic programming paradigms: name-passing calculi and concurrent constraint programming. In the resulting c...
متن کاملVirtual Reality Programming in Oz
| To handle the complexity of virtual reality (VR) applications it is desirable to use a high level language. Languages such as Lisp, Prolog and Smalltalk do not support concur-rency, reactivity and real-time control which are vital for VR-applications. However the new concurrent constraint programming paradigm in general, and Oz in particular supports these requirements. Oz is designed to supp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008